Random Graph Dynamics
نویسنده
چکیده
منابع مشابه
Dynamics on Unimodular Random Graphs
This paper is centered on covariant dynamics on random graphs and random networks (marked graphs), which can be described as rules to navigate the vertices that are preserved by graph/network isomorphisms. Such dynamics are referred to as vertex-shifts here. Unimodular random networks can be heuristically described as networks seen from a vertex chosen uniformly at random, both in the finite an...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملParallel dynamics of disordered Ising spin systems on finitely connected directed random graphs with arbitrary degree distributions
We study the stochastic parallel dynamics of Ising spin systems defined on finitely connected directed random graphs with arbitrary degree distributions, using generating functional analysis. For fully asymmetric graphs the dynamics of the system can be completely solved, due to the asymptotic absence of loops. For arbitrary graph symmetry, we solve the dynamics exactly for the first few time s...
متن کاملThe Integrated Density of States of the Random Graph Laplacian
We analyse the density of states of the random graph Laplacian in the percolating regime. A symmetry argument and knowledge of the density of states in the nonpercolating regime allows us to isolate the density of states of the percolating cluster (DSPC) alone, thereby eliminating trivially localised states due to finite subgraphs. We derive a nonlinear integral equation for the integrated DSPC...
متن کاملConsensus dynamics on random rectangular graphs
A random rectangular graph (RRG) is a generalization of the random geometric graph (RGG) in which the nodes are embedded into a rectangle with side lengths a and b = 1/a, instead of on a unit square [0, 1]2 . Two nodes are then connected if and only if they are separated at a Euclidean distance smaller than or equal to a certain threshold radius r . When a = 1 the RRG is identical to the RGG. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012